An Algorithm For Identifying Cognates Between Related Languages

The algorithm takes as only input a llst of words, preferably but not necessarily in phonemic transcription, in any two putatively related languages, and sorts it into decreasing order of probable cognatlon. The processing of a 250-1tem bilingual list takes about five seconds of CPU time on a DEC KLI091, and requires 56 pages of core memory. The algorithm is given no information whatsoever about the phonemic transcription .used, and even though cognate identification is carried out on the basis of a context-free one-for-one matching of indivldual characters, its cognation decisions are bettered by a trained linguist using more information only in cases of wordllsts sharing less than 40% cognates and involving complex, mu]tlple sound correspondences. I FUNDAMENTAL PROCEDURES A. Identifying Sound Correspondences Consider the following wordllst from two hypothetical Austronesian-llke ivnguages: